HATP: An HTN Planner for Robotics

نویسندگان

  • Raphaël Lallement
  • Lavindra de Silva
  • Rachid Alami
چکیده

Hierarchical Task Network (HTN) planning is a popular approach that cuts down on the classical planning search space by relying on a given hierarchical library of domain control knowledge. This provides an intuitive methodology for specifying high-level instructions on how robots and agents should perform tasks, while also giving the planner enough flexibility to choose the lower-level steps and their ordering. In this paper we present the HATP (Hierarchical Agentbased Task Planner) planning framework which extends the traditional HTN planning domain representation and semantics by making them more suitable for roboticists, and treating agents as “first class” entities in the language. The former is achieved by allowing “social rules” to be defined which specify what behaviour is acceptable/unacceptable by the agents/robots in the domain, and interleaving planning with geometric reasoning in order to validate online–with respect to a detailed geometric 3D world–the human/robot actions currently being pursued by HATP.1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planning and Plan-execution for Human-Robot Cooperative Task achievement

Human Robot cooperation brings several challenges to autonomous robotics such as adoption of a pro-active behavior, situation analysis and goal generation, intention explanation and adaptation and choice of a correct behavior toward the human. In this paper, we describe a decisional architecture for human robot interaction which addresses some of these challenges. The description will be center...

متن کامل

Integration of Online Learning into HTN Planning for Robotic Tasks

This paper extends hierarchical task network (HTN) planning with lightweight learning, considering that in robotics, actions have a non-zero probability of failing. Our work applies to A*-based HTN planners with lifting. We prove that the planner finds the plan of maximal expected utility, while retaining its lifting capability and efficient heuristic-based search. We show how to learn the prob...

متن کامل

Task Interaction in an HTN Planner

Hierarchical Task Network (HTN) planning uses task decomposition to plan for an executable sequence of actions as a solution to a problem. In order to reason effectively, an HTN planner needs expressive domain knowledge. For instance, a simplified HTN planning system such as JSHOP2 uses such expressivity and avoids some task interactions due to the increased complexity of the planning process. ...

متن کامل

A Flexible ANML Actor and Planner in Robotics

Planning in robotics must be considered jointly with Acting. Planning is an open loop activity which produces a plan, based on action models, the current state of the world and the desired goal state. Acting, on the other hand, is a closed loop on the environment activity (to execute command and perceive the state of the world). These two deliberative activities must be integrated and need to h...

متن کامل

A Deliberation Layer for Instantiating Robot Execution Plans from Abstract Task Descriptions

We present an application of Hierarchical Task Network (HTN) planning to create robot execution plans, that are adapted to the environment and the robot hardware from abstract task descriptions. Our main intention is to show that different robotic platforms can make use of the same high level symbolic task description. As an off-the-shelf planning component, the SHOP2 HTN planner is adopted. Al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1405.5345  شماره 

صفحات  -

تاریخ انتشار 2014